Chain Reduction for Binary and Zero-Suppressed Decision Diagrams

Chain reduction enables reduced ordered binary decision diagrams (BDDs) and zero-suppressed binary decision diagrams (ZDDs) to each take advantage of the others' ability to symbolically represent Boolean functions in compact form. For any Boolean function, its chain-reduced ZDD (CZDD) representation will be no larger than its ZDD representation, and at most twice the size of its BDD representation. The chain-reduced BDD (CBDD) of a function will be no larger than its BDD representation, and at most three times the size of its CZDD representation. Extensions to the standard algorithms for operating on BDDs and ZDDs enable them to operate on the chain-reduced versions. Experimental evaluations on representative benchmarks for encoding word lists, solving combinatorial problems, and operating on digital circuits indicate that chain reduction can provide significant benefits in terms of both memory and execution time

Model-free reinforcement learning for stochastic parity games

This paper investigates the use of model-free reinforcement learning to compute the optimal value in two-player stochastic games with parity objectives. In this setting, two decision makers, player Min and player Max, compete on a finite game arena - a stochastic game graph with unknown but fixed probability distributions - to minimize and maximize, respectively, the probability of satisfying a parity objective. We give a reduction from stochastic parity games to a family of stochastic reachability games with a parameter ε, such that the value of a stochastic parity game equals the limit of the values of the corresponding simple stochastic games as the parameter ε tends to 0. Since this reduction does not require the knowledge of the probabilistic transition structure of the underlying game arena, model-free reinforcement learning algorithms, such as minimax Q-learning, can be used to approximate the value and mutual best-response strategies for both players in the underlying stochastic parity game. We also present a streamlined reduction from 112-player parity games to reachability games that avoids recourse to nondeterminism. Finally, we report on the experimental evaluations of both reductions

Analog Property Checkers: A Ddr2 Case Study

The formal specification component of verification can be exported to simulation through the idea of property checkers. The essence of this approach is the automatic construction of an observer from the specification in the form of a program that can be interfaced with a simulator and alert the user if the property is violated by a simulation trace. Although not complete, this lighter approach to formal verification has been effectively used in software and digital hardware to detect errors. Recently, the idea of property checkers has been extended to analog and mixed-signal systems. In this paper, we apply the property-based checking methodology to an industrial and realistic example of a DDR2 memory interface. The properties describing the DDR2 analog behavior are expressed in the formal specification language stl/psl in form of assertions. The simulation traces generated from an actual DDR2 interface design are checked with respect to the stl/psl assertions using the amt tool. The focus of this paper is on the translation of the official (informal and descriptive) specification of two non-trivial DDR2 properties into stl/psl assertions. We study both the benefits and the current limits of such approach

INPOP08, a 4-D planetary ephemeris: From asteroid and time-scale computations to ESA Mars Express and Venus Express contributions

The latest version of the planetary ephemerides developed at the Paris Observatory and at the Besancon Observatory is presented here. INPOP08 is a 4-dimension ephemeris since it provides to users positions and velocities of planets and the relation between TT and TDB. Investigations leading to improve the modeling of asteroids are described as well as the new sets of observations used for the fit of INPOP08. New observations provided by the European Space Agency (ESA) deduced from the tracking of the Mars Express (MEX) and Venus Express (VEX) missions are presented as well as the normal point deduced from the Cassini mission. We show the huge impact brought by these observations in the fit of INPOP08, especially in terms of Venus, Saturn and Earth-Moon barycenter orbits.Comment: 14 pages. submitted to A&A. accepted in A&

SAT-based Explicit LTL Reasoning

We present here a new explicit reasoning framework for linear temporal logic (LTL), which is built on top of propositional satisfiability (SAT) solving. As a proof-of-concept of this framework, we describe a new LTL satisfiability tool, Aalta\_v2.0, which is built on top of the MiniSAT SAT solver. We test the effectiveness of this approach by demonnstrating that Aalta\_v2.0 significantly outperforms all existing LTL satisfiability solvers. Furthermore, we show that the framework can be extended from propositional LTL to assertional LTL (where we allow theory atoms), by replacing MiniSAT with the Z3 SMT solver, and demonstrating that this can yield an exponential improvement in performance

Parallelizing Deadlock Resolution in Symbolic Synthesis of Distributed Programs

Previous work has shown that there are two major complexity barriers in the synthesis of fault-tolerant distributed programs: (1) generation of fault-span, the set of states reachable in the presence of faults, and (2) resolving deadlock states, from where the program has no outgoing transitions. Of these, the former closely resembles with model checking and, hence, techniques for efficient verification are directly applicable to it. Hence, we focus on expediting the latter with the use of multi-core technology. We present two approaches for parallelization by considering different design choices. The first approach is based on the computation of equivalence classes of program transitions (called group computation) that are needed due to the issue of distribution (i.e., inability of processes to atomically read and write all program variables). We show that in most cases the speedup of this approach is close to the ideal speedup and in some cases it is superlinear. The second approach uses traditional technique of partitioning deadlock states among multiple threads. However, our experiments show that the speedup for this approach is small. Consequently, our analysis demonstrates that a simple approach of parallelizing the group computation is likely to be the effective method for using multi-core computing in the context of deadlock resolution

Reward Shaping for Reinforcement Learning with Omega-Regular Objectives

Recently, successful approaches have been made to exploit good-for-MDPs automata (B\"uchi automata with a restricted form of nondeterminism) for model free reinforcement learning, a class of automata that subsumes good for games automata and the most widespread class of limit deterministic automata. The foundation of using these B\"uchi automata is that the B\"uchi condition can, for good-for-MDP automata, be translated to reachability. The drawback of this translation is that the rewards are, on average, reaped very late, which requires long episodes during the learning process. We devise a new reward shaping approach that overcomes this issue. We show that the resulting model is equivalent to a discounted payoff objective with a biased discount that simplifies and improves on prior work in this direction

Molecular characterization of the Montecristo feral goats in the Mediterranean context

The Montecristo wild goat is an endangered feral population occurring on the homonymous island in the Tuscan Archipelago since a long time. The origins of Montecristo goats are still debated, with authors dating their introduction either back to Neolithic times or between the 6th and 13th century of the Common Era. To investigate the evolutionary history and relationships of this population we assembled a 50K SNP dataset including 55 Mediterranean breeds and two nuclei of Montecristo goats sampled on the island and from an ex situ conservation project on the Italian mainland, respectively. Diversity levels, gene flow, population structure and relationships were assessed through multiple approaches. The insular population scored the lowest values of both observed and expected heterozygosity, highlighting reduced genetic variation, while the ex situ nucleus highlighted a less severe reduction. Multivariate statistics, Neighbour-network and population structure analyses clearly separated the insular nucleus from all other breeds, but also the two Montecristo populations from each other. Treemix software analysis pinpointed possible genetic inputs received by the two Montecristo goat nuclei from different sources, while Runs Of Homozygosity (ROHs) indicated an ancient bottleneck/founder effect in the insular population and recent inbreeding in the ex situ one. Overall, our results suggest that Montecristo goats experienced several demographic fluctuations combined with admixture events over time, and highlighted a noticeable differentiation between the two nuclei. This evidence can serve as a starting point to implement marker-assisted conservation plans for the endangered Montecristo feral goat